mountains and trees have many similarities. in this way, simorgh of shahnameh shifts from the tree of vispobish to alborz mountain. if simorgh has spiritual existence in avesta, a devilish side has been added to it in shahnameh. in avesta, it lives on a tree, but in shahnameh we find him on alborz mountain. all the researches done on shahnameh and iranian mythology did not pay any attention to ...

The column-tree constructional schemes allows for a reliable and convenient erection of moment resisting steel frames. Strengthening of column-tree connection with a haunch part can significantly improve seismic behavior of whole system. In the current study behavior of column-tree connections with haunched beams and end plate splices have been investigated. Special attention was paid for evalu...

We consider the class of channel graphs which can be viewed as compositions of two copies, right and left, of a complete binary tree with terminal nodes of the right tree connected to distinct terminal nodes of the left tree. We study the connection patterns of the two binary trees to minimize the blocking probability of the resulting channel graphs. We show that the connection patterns given b...

* Corresponding author. AbstractThe problem of finding a minimum-cast multicast tree ( Steiner tree) is known as NP-complete. Heuristic-based algorithms for this problem to achieve good performance are usually time-consuming. In this paper, we propose a new strategy called tree-caching for efficient setup of multicast connections in connection-oriented networks. In this scheme, the tree topolog...

In this paper, we propose a ooding method, called Switch-Aided Flooding (SAF), for use in ATM networks. SAF-based protocols take advantage of hardware-supported cell relay and cell duplication, characteristic of such networks, in order to reduce the time needed to disseminate changes in network topology and resource availability. SAF protocols use a spanning multipoint connection (SMC), which i...

This thesis explores the relative complexity of proofs produced by the automatic theorem proving procedures of analytic tableaux, linear resolution, the connection method, tree resolution and the Davis-Putnam procedure. It is shown that tree resolution simulates the improved tableau procedure and that SL-resolution and the connection method are equivalent to restrictions of the improved tableau...

2 Binary search trees 2 2.1 Definition of a binary search tree . . . . . . . . . . . . . . . . . . 2 2.2 Profile of a binary search tree . . . . . . . . . . . . . . . . . . . . 3 2.2.1 Level polynomial. BST martingale . . . . . . . . . . . . . 3 2.2.2 Embedding in continuous time. Yule tree . . . . . . . . . . 6 2.2.3 Connection Yule tree binary search tree . . . . . . . . . . 7 2.2.4 Asymptoti...

We present YOPT a program that plays Hex using Monte-Carlo tree search. We describe heuristics that improve simulations and tree search. We also address the combination of Monte-Carlo tree search with virtual connection search.

MANET is an autonomous distributed system in which mobile nodes are of random nature. Establishing Connection among the nodes is a challenging issue. In this paper we have done a study on the various challenges of MANET which affects the performance of the network and by using spanning tree how it can be controlled. Spanning tree concept provides a loop free network where peer to peer connectio...

2 Binary search trees 2 2.1 Definition of a binary search tree . . . . . . . . . . . . . . . . . . 2 2.2 Profile. Discrete martingale . . . . . . . . . . . . . . . . . . . . . 3 2.3 Embedding in continuous time. Yule tree . . . . . . . . . . . . . . 4 2.4 Martingale connection Yule tree binary search tree . . . . . . . . 5 2.5 Asymptotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...